Cauchy's Equation and Sufficient Statistics on Arcwise Connected Spaces
نویسندگان
چکیده
منابع مشابه
compactifications and function spaces on weighted semigruops
chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...
15 صفحه اولSufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملOn fuzzy soft connected topological spaces
In this work, we introduce notion of connectedness on fuzzy soft topological spaces and present fundamentals properties. We also investigate effect to fuzzy soft connectedness. Moreover, $C_i$-connectedness which plays an important role in fuzzy topological space extend to fuzzy soft topological spaces.
متن کاملConnected and Hyperconnected Generalized Topological Spaces
A. Csaszar introduced and extensively studied the notion of generalized open sets. Following Csazar, we introduce a new notion hyperconnected. We study some specic properties about connected and hyperconnected in generalized topological spaces. Finally, we characterize the connected component in generalized topological spaces.
متن کاملOn Algorithmic Strong Sufficient Statistics
The notion of a strong sufficient statistic was introduced in [N. Vereshchagin, Algorithmic Minimal Sufficient Statistic Revisited. Proc. 5th Conference on Computability in Europe, CiE 2009, LNCS 5635, pp. 478-487]. In this paper, we give a survey of fine properties of strong sufficient statistics and show that there are strings for which complexity of every strong sufficient statistic is much ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1970
ISSN: 0003-4851
DOI: 10.1214/aoms/1177697079